Computing the output distribution of a stack filter from the DNF of its positive Boolean function

نویسنده

  • Marcel Wild
چکیده

The majority of nonlinear filters used in practise are stack filters. An algorithm is presented which calculates the output distribution of an arbitrary stack filter S from the disjunctive normal form (DNF) of its underlying positive Boolean function. The so called selection probabilities can be computed along the way.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The many benefits of putting stack filters into disjunctive or conjunctive normal form

Stack filters are nonlinear filters used for image processing (examples: median filters, order statistics). In the translation-invariant case a stack filter is determined by a positive Boolean function b. Many important properties of stack filters (idempotency, co-idempotency, order relations) can be tested in polynomial time if the DNF and/or CNF of b are known. © 2005 Elsevier B.V. All rights...

متن کامل

Learning of Boolean Functions Using Support Vector Machines

This paper concerns the design of a Support Vector Machine (SVM) appropriate for the learning of Boolean functions. This is motivated by the need of a more sophisticated algorithm for classification in discrete attribute spaces. Classification in discrete attribute spaces is reduced to the problem of learning Boolean functions from examples of its input/output behavior. Since any Boolean functi...

متن کامل

Reliability assessment of power distribution systems using disjoint path-set algorithm

Finding the reliability expression of different substation configurations can help design a distribution system with the best overall reliability. This paper presents a computerized a nd implemented algorithm, based on Disjoint Sum of Product (DSOP) algorithm. The algorithm was synthesized and applied for the first time to the determination of reliability expression of a substation to determine...

متن کامل

Bidual Horn Functions and Extensions

Partially defined Boolean functions (pdBf) , where are disjoint sets of true and false vectors, generalize total Boolean functions by allowing that the function values on some input vectors are unknown. The main issue with pdBfs is the extension problem, which is deciding, given a pdBf, whether it is interpolated by a function from a given class of total Boolean functions, and computing a formu...

متن کامل

Semi-G-filters, Stonean filters, MTL-filters, divisible filters, BL-filters and regular filters in residuated lattices

At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1001.2416  شماره 

صفحات  -

تاریخ انتشار 2010